Counting Finite Languages by Total Word Length
نویسنده
چکیده
We investigate the number of sets of words that can be formed from a finite alphabet, counted by the total length of the words in the set. An explicit expression for the counting sequence is derived from the generating function, and asymptotics for large alphabet size and large total word length are discussed. Moreover, we derive a Gaussian limit law for the number of words in a random finite language.
منابع مشابه
On the Complexity of Membership and Counting in Height-Deterministic Pushdown Automata
Visibly pushdown languages properly generalise regular languages and are properly contained in deterministic context-free languages. The complexity of their membership problem is equivalent to that of regular languages. However, the corresponding counting problem – computing the number of accepting paths in a visibly pushdown automaton – could be harder than counting paths in a non-deterministi...
متن کاملModular and Threshold Subword Counting and Matrix Representations of Finite Monoids
The subword relation reveals interesting combinatorial properties and plays a prominent role in formal language theory. For instance, recall that languages consisting of all words over Σ having a given word u ∈ Σ∗ as a subword serve as a generating system for the Boolean algebra of so-called piecewise testable languages. It was a deep study of combinatorics of the subword relation that led Simo...
متن کاملCounting Lyndon Factors
In this paper, we determine the maximum number of distinct Lyndon factors that a word of length n can contain. We also derive formulas for the expected total number of Lyndon factors in a word of length n on an alphabet of size σ, as well as the expected number of distinct Lyndon factors in such a word. The minimum number of distinct Lyndon factors in a word of length n is 1 and the minimum tot...
متن کاملar X iv : 0 80 5 . 17 55 v 2 [ m at h . G R ] 1 7 M ay 2 00 8 COMBABLE FUNCTIONS , QUASIMORPHISMS , AND THE CENTRAL LIMIT THEOREM
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include (1) homomorphisms to Z (2) word length with respect to a finite gener...
متن کاملar X iv : 0 80 5 . 17 55 v 3 [ m at h . G R ] 1 7 Ju n 20 09 COMBABLE FUNCTIONS , QUASIMORPHISMS , AND THE CENTRAL
A function on a discrete group is weakly combable if its discrete derivative with respect to a combing can be calculated by a finite state automaton. A weakly combable function is bicombable if it is Lipschitz in both the left and right invariant word metrics. Examples of bicombable functions on word-hyperbolic groups include (1) homomorphisms to Z (2) word length with respect to a finite gener...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011